Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
301	The second annual Bristol Algorithms Days will gather researchers interested in the study of theoretical and applied aspects of algorithms. This interdisciplinary workshop will consider work at the boundaries of Computer Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:08 Computational complexity theory Algorithm Mathematical logic Randomized algorithm Approximation algorithm Combinatorics Theoretical computer science Applied mathematics Mathematics
302	REHIST: Relative Error Histogram Construction Algorithms Add to Reading List Source URL: www.vldb.org Language: English - Date: 2006-07-29 01:28:01 Computational complexity theory Analysis of algorithms Non-parametric statistics Database theory V-optimal histograms Histogram Interval tree Dynamic programming Approximation algorithm Theoretical computer science Statistics Applied mathematics
303	T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-09-27 01:28:53 NP-complete problems Graph theory Approximation algorithm Hypergraph Time complexity Vertex cover Feedback arc set Theoretical computer science Computational complexity theory Applied mathematics
304	T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan† Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-09-27 01:28:53 NP-complete problems Graph theory Approximation algorithm Hypergraph Time complexity Vertex cover Feedback arc set Theoretical computer science Computational complexity theory Applied mathematics
305	Package ‘TSP’ September 6, 2013 Type Package Title Traveling Salesperson Problem (TSP) Version[removed]Date[removed] Add to Reading List Source URL: cran.r-project.org Language: English - Date: 2013-09-06 14:45:51 Applied mathematics NP-complete problems Operations research Combinatorial optimization Approximation algorithms Concorde TSP Solver Nearest neighbour algorithm Lin–Kernighan heuristic Concorde Theoretical computer science Mathematics Travelling salesman problem
306	JMLR: Workshop and Conference Proceedings vol[removed]–24 Learning Valuation Functions Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2012-05-24 21:07:27 Computational complexity theory Analysis of algorithms Field theory Fourier analysis Submodular set function Subadditivity Valuation Approximation algorithm Big O notation Mathematics Theoretical computer science Mathematical analysis
307	Approximation Algorithms for Art Gallery Problems in Polygons and Terrains Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2011-09-06 01:58:27 Computational geometry Triangulation Art gallery problem Simple polygon Polygon triangulation Polygon Rectilinear polygon Vertex Internal and external angle Geometry Polygons Euclidean plane geometry
308	Introduction to Approximation Algorithms Subir Kumar Ghosh School of Technology & Computer Science Tata Institute of Fundamental Research Mumbai[removed], India Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2011-01-10 05:25:38 NP-complete problems Approximation algorithm NP-complete Vertex cover Optimization problem Travelling salesman problem Steiner tree problem Set cover problem Graph coloring Theoretical computer science Mathematics Computational complexity theory
309	15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
310	Part II Approximation Algorithms Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2011-02-08 14:10:43 Operations research Mathematical optimization Combinatorial optimization NP-complete problems Knapsack problem Polynomial-time approximation scheme Dynamic programming Approximation algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE